A Memetic Algorithm for the Vehicle Routing Problem with Cross Docking

Authors

  • Larioui, Sanae University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco
Abstract:

In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respecting time window constraints of suppliers and customers and a time horizon for the whole transportation operation. Rummaging through all the work of literature on vehicle routing problems with cross-docking, there is no work that considers that customer will receive its requests from several suppliers; this will be the point of innovation of this work. A heuristic and a memetic algorithm are used to solve the problem. The proposed algorithms are implemented and tested on data sets involving up to 200 nodes (customers and suppliers). The first results show that the memetic algorithm can produce high quality solutions.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

a memetic algorithm for the vehicle routing problem with cross docking

in this paper we address the vrpcd, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. the products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. the objective of the vrpcd is to minimize the total traveled distance while respe...

full text

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

full text

A mathematical model for vehicle routing and scheduling problem with cross-docking by considering risk

Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, ...

full text

A Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows

This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and deliv...

full text

Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...

full text

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 3

pages  833- 855

publication date 2015-11

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023